首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   200篇
  免费   5篇
  国内免费   16篇
化学   42篇
力学   6篇
综合类   2篇
数学   139篇
物理学   32篇
  2023年   8篇
  2022年   4篇
  2021年   2篇
  2020年   7篇
  2019年   5篇
  2018年   2篇
  2017年   3篇
  2016年   4篇
  2015年   5篇
  2014年   4篇
  2013年   21篇
  2012年   10篇
  2011年   18篇
  2010年   14篇
  2009年   13篇
  2008年   12篇
  2007年   17篇
  2006年   6篇
  2005年   11篇
  2004年   7篇
  2003年   5篇
  2002年   1篇
  2001年   2篇
  2000年   2篇
  1999年   2篇
  1998年   2篇
  1997年   4篇
  1996年   6篇
  1995年   3篇
  1994年   1篇
  1993年   2篇
  1992年   2篇
  1991年   1篇
  1989年   1篇
  1988年   1篇
  1986年   2篇
  1985年   1篇
  1984年   2篇
  1983年   2篇
  1982年   1篇
  1981年   1篇
  1979年   1篇
  1978年   2篇
  1974年   1篇
排序方式: 共有221条查询结果,搜索用时 78 毫秒
211.
212.
考察在连续时间情形下,一类随机系数的跨国(主要研究两国之间)证券投资组合在均值-方差(M-V)优化准则下的最优投资策略(u*(t)),并进一步对该投资组合的有效边界进行研究,得出均值和方差之间的具体表达式.  相似文献   
213.
The traditional model selection criterions try to make a balance between fitted error and model complexity. Assumptions on the distribution of the response or the noise, which may be misspecified, should be made before using the traditional ones. In this article, we give a new model selection criterion, based on the assumption that noise term in the model is independent with explanatory variables, of minimizing the association strength between regression residuals and the response, with fewer assumptions. Maximal Information Coefficient (MIC), a recently proposed dependence measure, captures a wide range of associations, and gives almost the same score to different type of relationships with equal noise, so MIC is used to measure the association strength. Furthermore, partial maximal information coefficient (PMIC) is introduced to capture the association between two variables removing a third controlling random variable. In addition, the definition of general partial relationship is given.  相似文献   
214.
215.
Selection is a vital component used in Evolutionary Algorithms (EA) where the fitness value of the solution has influence on the evolution process. Normally, any efficient selection method makes use of the Darwinian principle of natural selection (i.e., survival of the fittest). Harmony search (HS) is a recent EA inspired by musical improvisation process to seek a pleasing harmony. Originally, two selection methods are used in HS: (i) memory consideration selection method where the values of the decision variables are randomly selected from the population (or solutions stored in harmony memory (HM)) to generate a new harmony, and (ii) selecting a new solution in HM whereby a greedy selection is used to update the HM. The memory consideration selection, the focal point of this paper, is not based on natural selection principle which draws heavily on random selection. In this paper, novel selection schemes which replace the random selection scheme in memory consideration are investigated, comprising global-best, fitness-proportional, tournament, linear rank and exponential rank. The proposed selection schemes are individually altered and incorporated in the process of memory consideration and each adoption is realized as a new HS variation. The performance of the proposed HS variations are evaluated and a comparative study is conducted. The experimental results using benchmark functions show that the selection schemes incorporated in memory consideration directly affect the performance of HS algorithm. Finally, a parameter sensitivity analysis of the proposed HS variations is analyzed.  相似文献   
216.
217.
In this work univariate set-valued functions (SVFs, multifunctions) with 1D compact sets as images are considered. For such a continuous SFV of bounded variation (CBV multifunction), we show that the boundaries of its graph are continuous, and inherit the continuity properties of the SVF. Based on these results we introduce a special class of representations of CBV multifunctions with a finite number of ‘holes’ in their graphs. Each such representation is a finite union of SVFs with compact convex images having boundaries with continuity properties as those of the represented SVF. With the help of these representations, positive linear operators are adapted to SVFs. For specific positive approximation operators error estimates are obtained in terms of the continuity properties of the approximated multifunction.  相似文献   
218.
本文运用模糊数学思想 ,按照相对隶属度原则 ,通过制定各门课程之间的权重系数 ,建立了一种新的奖学金评定的模糊优选数学模型 .该模型解决了按总成绩排名评定法中所存在的一些问题 .使评定的结果更具科学性与合理性 ,同时模型可推广到其它评比当中  相似文献   
219.
在主动式红外遥感测量中,大气中痕量气体的红外吸收与不同红外波段的透过率光谱有关。在很多情况下,透过率光谱在光谱定量分析中起到重要的作用,因此,对测量和仿真的透过率光谱的波段进行优化选择是定量分析的关键。文章对最佳透过率测量范围进行了理论分析, 得到了对应于待测气体浓度反演相对误差最小的理论最佳透过率值;基于谱线的洛伦兹线型通过计算得到了待测气体分子的吸收截面, 同时给出了透过率光谱的校准训练集;确定了单组分CO2光谱测量分析的波段,优化了多组分CO, CO2和N2O光谱同时测量分析的波段并成功地应用于开放光路光谱仪系统。光谱拟合分析结果表明,测量光谱与参考光谱得到了很好的拟合,拟合均方根误差小于1%。  相似文献   
220.
Expanding the chemical diversity of peptide macrocycle libraries for display selection is desirable to improve their potential to bind biomolecular targets. We now have implemented a considerable expansion through a large aromatic helical foldamer inclusion. A foldamer was first identified that undergoes flexizyme-mediated tRNA acylation and that is capable of initiating ribosomal translation with yields sufficiently high to perform an mRNA display selection of macrocyclic foldamer–peptide hybrids. A hybrid macrocyclic nanomolar binder to the C-lobe of the E6AP HECT domain was selected that showed a highly converged peptide sequence. A crystal structure and molecular dynamics simulations revealed that both the peptide and foldamer are helical in an intriguing reciprocal stapling fashion. The strong residue convergence could be rationalized based on their involvement in specific interactions with the target protein. The foldamer stabilizes the peptide helix through stapling and through contacts with key residues. These results altogether represent a significant extension of the chemical space amenable to display selection and highlight possible benefits of inserting an aromatic foldamer into a peptide macrocycle for the purpose of protein recognition.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号